Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination
نویسندگان
چکیده
منابع مشابه
Parametric Markov Chains: PCTL Complexity and Fraction-free Gaussian Elimination
Parametric Markov chains have been introduced as a model for families of stochastic systems that rely on the same graph structure, but differ in the concrete transition probabilities. The latter are specified by polynomial constraints for the parameters. Among the tasks typically addressed in the analysis of parametric Markov chains are (1) the computation of closed-form solutions for reachabil...
متن کاملA Generalized Sylvester Identity and Fraction-free Random Gaussian Elimination
Sylvester's identity is a well-known identity which can be used to prove that certain Gaussian elimination algorithms are fraction-free. In this paper we will generalize Sylvester's identity and use it to prove that certain random Gaussian elimination algorithms are fraction-free. This can be used to yield fraction-free algorithms for solving Ax = b (x 0) and for the simplex method in linear pr...
متن کاملSynthesis for PCTL in Parametric Markov Decision Processes
In parametric Markov Decision Processes (PMDPs), transition probabilities are not fixed, but are given as functions over a set of parameters. A PMDP denotes a family of concrete MDPs. This paper studies the synthesis problem for PCTL in PMDPs: Given a specification Φ in PCTL, we synthesise the parameter valuations under which Φ is true. First, we divide the possible parameter space into hyper-r...
متن کاملParametric LTL on Markov Chains
This paper is concerned with the verification of finite Markov chains against parametrized LTL (pLTL) formulas. In pLTL, the untilmodality is equipped with a bound that contains variables; e.g., ♦6x φ asserts that φ holds within x time steps, where x is a variable on natural numbers. The central problem studied in this paper is to determine the set of parameter valuations V≺p(φ) for which the p...
متن کاملPCTL model checking of Markov chains: Truth and falsity as winning strategies in games
Probabilisticmodel checking is a technique for verifyingwhether amodel such as aMarkov chain satisfies a probabilistic, behavioral property – e.g. ‘‘with probability at least 0.999, a device will be elected leader’’. Such properties are expressible in probabilistic temporal logics, e.g. PCTL, and efficient algorithms exist for checking whether these formulae are true or false on finite-state mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2020
ISSN: 0890-5401
DOI: 10.1016/j.ic.2019.104504